An Enhanced Sorting Tree Energy-Efficient Routing Scheme for Wireless Sensor Networks with Mobile Sink
نویسندگان
چکیده
Wireless sensor networks with mobile sink are expected to increase the flexibility for gathering information in the large-scale sensing and detecting environments. The sink can randomly move within the sensing area to collect the sensing data. Energy saving becomes one of the most important features for the sensor nodes to extend their lifetime in such networks. To provide reasonable energy consumption and to improve the network lifetime for the wireless sensor network systems, new and efficient energy saving schemes must be developed. A tree based energy-efficient routing scheme is proposed in this paper to reduce the energy consumption in wireless sensor networks with mobile sink. The main goal of this scheme is to reduce the data transmission distances of sensor nodes by using the tree structure and multi-hop concepts. Based on the location of mobile sink, the distances between the sensor nodes, and the residual energy of each sensor node, the proposed scheme makes an adaptive decision for creating the routing structure. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the energy consumption and network lifetime for the wireless sensor networks with mobile sink.
منابع مشابه
An Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کامل